Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
911	RFF: A Robust, FF-Based MDP Planning Algorithm for Generating Policies with Low Probability of Failure Florent Teichteil-K¨onigsbuch and Guillaume Infantes Ugur Kuter Add to Reading List Source URL: www.cs.umd.edu Language: English - Date: 2008-09-15 10:48:04 Randomness Complexity classes Probabilistic complexity theory Quantum complexity theory Automated planning and scheduling Algorithm Planning Domain Definition Language Monte Carlo method SL Theoretical computer science Computational complexity theory Applied mathematics
912	Original Research Article published: 30 June 2011 doi: [removed]fnhum[removed]HUMAN NEUROSCIENCE Add to Reading List Source URL: www.jakubszymanik.com Language: English - Date: 2011-11-28 07:34:39 Communication Complexity classes Cognitive science Motor control Parameterized complexity Models of communication Computational complexity theory Complexity Actor model Behavior Ethology Science
913	On the Tractability of Comparing Informational Structures∗ C´edric D´egremont1 , Lena Kurzen2 , and Jakub Szymanik3 1, 3 2 Add to Reading List Source URL: www.jakubszymanik.com Language: English - Date: 2011-11-28 09:21:46 Philosophical logic Modal logic Model theory Complexity classes Theoretical computer science Bisimulation Kripke semantics Epistemic modal logic Saul Kripke Logic Mathematical logic Mathematics
914	Quantiers in TIME and SPACE Computational Complexity of Generalized Quantiers in Natural Language Jakub Szymanik Add to Reading List Source URL: www.jakubszymanik.com Language: English - Date: 2011-03-21 08:58:36 Science Mathematical logic Institute for Logic Language and Computation Computational complexity theory Complexity Algorithm Descriptive complexity theory EXPTIME P Applied mathematics Complexity classes Mathematics
915	Brit. J. Phil. Sci[removed]), 113–140 Deterministic Chance? Jonathan Schaffer ABSTRACT Can there be deterministic chance? That is, can there be objective chance values other Add to Reading List Source URL: www.jonathanschaffer.org Language: English - Date: 2011-01-21 08:32:56 Metaphysics Determinism Complexity classes Science Probability and statistics Indeterminism Incompatibilism Probability NL Causality Philosophy of science Philosophy
916	Backward Induction is PTIME-complete Jakub Szymanik∗ Institute of Logic Language and Computation, University of Amsterdam [removed] Abstract. We prove that the computational problem of finding backward induc Add to Reading List Source URL: jakubszymanik.com Language: English - Date: 2013-07-13 09:14:28 Complexity classes Finite model theory Graph connectivity Game theory FO Reachability P Extensive-form game Tree Theoretical computer science Graph theory Mathematics
917	Physiological Chemistry and Physics and Medical NMR Volume 35, Number 2, 2003 Addresses of Chief Editor and Editorial College Chief Editor Gilbert N. Ling Add to Reading List Source URL: www.physiologicalchemistryandphysics.com Language: English - Date: 2007-01-16 15:02:08 Complexity classes Materials science Adsorption Surface chemistry Properties of water NP Hydrogen bond Water Chemistry Inorganic solvents Oxides
918	On the complexity Andrea Dipartimento Add to Reading List Source URL: www.cs.unibo.it Language: English - Date: 2007-10-31 09:25:33 Computability theory Lambda calculus Algorithm SL Reduction L Connectivity Theoretical computer science Applied mathematics Complexity classes
919	On the Incompressibility of Monotone DNFs Matthias P. Krieger∗ Johann Wolfgang Goethe-Universit¨at Frankfurt am Main Institut f¨ ur Informatik Lehrstuhl f¨ Add to Reading List Source URL: www.thi.informatik.uni-frankfurt.de Language: English - Date: 2010-11-03 11:40:59 Circuit complexity Computational complexity theory Boolean algebra Complexity classes Implicant Logic in computer science Boolean circuit Circuit ACC0 Theoretical computer science Mathematics Applied mathematics
920	Invitation to Complexity Theory Complexity theory provides new viewpoints on various phenomena that were once considered by past thinkers. By Oded Goldreich DOI: [removed][removed] Add to Reading List Source URL: www.wisdom.weizmann.ac.il Language: English - Date: 2013-03-27 12:14:10 Probabilistic complexity theory Mathematical optimization Computational complexity theory Structural complexity theory Complexity Average-case complexity P versus NP problem NP-complete Pseudorandom generator Theoretical computer science Applied mathematics Complexity classes

UPDATE